Ambiguity in Finite Automata
نویسندگان
چکیده
منابع مشابه
On Finite and Polynomial Ambiguity of Weighted Tree Automata
We consider finite and polynomial ambiguity of weighted tree automata. Concerning finite ambiguity, we show that a finitely ambiguous weighted tree automaton can be decomposed into a sum of unambiguous automata. For polynomial ambiguity, we show how to decompose a polynomially ambiguous weighted tree automaton into simpler polynomially ambiguous automata and then analyze the structure of these ...
متن کاملA Note on the Ambiguity of Finite Automata
We give a new and simple proof of a key lemma on the rank of a matrix in Leung's paper [3], where he showed there exists a family of nondeterministic nite automata fAng, with n states and exponential ambiguity, such that any smallest equivalent polynomially ambiguous nite automaton has 2 1 states. Keyword: nondeterministic automata, ambiguity, automata theory.
متن کاملOn the Degree of Ambiguity of Finite Automata
We investigate the ambiguity behavior of finite automata in connection with their inner structure. We show that the degree of ambiguity of a finitely ambiguous nondeterministic finite automaton (NFA) with n states is at most 5”“.n”. There is a simple criterion which characterizes the infinite degree of ambiguity of an NFA, and which is decidable in polynomial time. The degree of growth of the a...
متن کاملAmbiguity, Nondeterminism and State Complexity of Finite Automata
The degree of ambiguity counts the number of accepting computations of a nondeterministic finite automaton (NFA) on a given input. Alternatively, the nondeterminism of an NFA can be measured by counting the amount of guessing in a single computation or the number of leaves of the computation tree on a given input. This paper surveys work on the degree of ambiguity and on various nondeterminism ...
متن کاملGeneral Algorithms for Testing the Ambiguity of Finite Automata
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ǫtransitions. It gives an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|2E), and finite or polynomial ambiguity in time O(|A|3E), where |A|E denotes the number of transitions of A. These complexities significantly improve over the previo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1977
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v6i82.6498